翻訳と辞書 Words near each other ・ Burson-Marsteller ・ Burst ・ Burst (band) ・ Burst (EP) ・ Burst (village) ・ Burst and Bloom ・ Burst Angel ・ Burst Apart ・ Burst Ball Barrage!! Super B-Daman ・ Burst Bucker Pro Pickups ・ Burst charge ・ Burst City ・ Burst cutting area ・ Burst dimming ・ Burst error ・ Burst error-correcting code ・ Burst fracture ・ Burst kinetics ・ Burst lobe ・ Burst mode ・ Burst mode (computing) ・ Burst mode (photography) ・ Burst mode (weapon) ・ Burst mode clock and data recovery ・ Burst noise ・ Burst of Joy ・ Burst of Youth for the Nation ・ Burst phase ・ Burst Radio ・ Burst suppression Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Burst error-correcting code ： ウィキペディア英語版 Burst error-correcting code In coding theory, burst error-correcting codes employ methods of correcting burst errors, which are errors that occur in many consecutive bits rather than occurring in bits independently of each other. Many codes have been designed to correct random errors. Sometimes, however, channels may introduce errors which are localized in a short interval. Such errors occur in a burst (called burst errors) because they occur in many consecutive bits. Examples of burst errors can be found extensively in storage mediums. These errors may be due to physical damage such as scratch on a disc or a stroke of lightning in case of wireless channels. They are not independent; they tend to be spatially concentrated. If one bit has an error, it is likely that the adjacent bits could also be corrupted. The methods used to correct random errors are inefficient to correct burst errors. ==Definitions== A burst of length $\backslash textstyle\; l$〔Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes〕 Say a codeword $\backslash textstyle\; C$ is transmitted, and it is received as $\backslash textstyle\; Y\; =\; C\; +\; E$. Then, the error vector $\backslash textstyle\; E$ is called a burst of length $\backslash textstyle\; l$ if the nonzero components of $\backslash textstyle\; E$ are confined to $\backslash textstyle\; l$ consecutive components. For example, $\backslash textstyle\; E\; =\; (0\backslash textbf0)$ is a burst of length $\backslash textstyle\; l\; =\; 7$. Although this definition is sufficient to describe what a burst error is, the majority of the tools developed for burst error correction rely on cyclic codes. This motivates our next definition. A cyclic burst of length $\backslash textstyle\; l$〔 An error vector $\backslash textstyle\; E$ is called a cyclic burst error of length $\backslash textstyle\; l$ if its nonzero components are confined to $\backslash textstyle\; l$ cyclically consecutive components. For example, the previously considered error vector $\backslash textstyle\; E\; =\; (010000110)$, is a cyclic burst of length $\backslash textstyle\; l\; =\; 5$, since we consider the error starting at position $\backslash textstyle\; 6$ and ending at position $\backslash textstyle\; 1$. Notice the indices are $\backslash textstyle\; 0$-based, that is, the first element is at position $\backslash textstyle\; 0$. For the remainder of this article, we will use the term burst to refer to a cyclic burst, unless noted otherwise. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Burst error-correcting code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.